On the Representation of Gliders in Rule 54 by De Bruijn and Cycle Diagrams
نویسندگان
چکیده
Rule 54, in Wolfram’s notation, is one of elementary yet complexly behaving one-dimensional cellular automata. The automaton supports gliders, glider guns and other non-trivial long transients. We show how to characterize gliders in Rule 54 by diagram representations as de Bruijn and cycle diagrams; offering a way to present each glider in Rule 54 with particular characteristics. This allows a compact encoding of initial conditions which can be used in implementing non-trivial collision-based computing in one-dimensional cellular automata.
منابع مشابه
Complete Characterization of Structure of Rule 54
The dynamics of the rule 54 one-dimensional, two-state cellular automaton (CA) are a discrete analog of a space-time dynamics of excitations in a nonlinear active medium with mutual inhibition. A cell switches its state 0 to state 1 if one of its two neighbors is in state 1 (propagation of a perturbation), and a cell remains in state 1 only if its two neighbors are in state 0. A lateral inhibit...
متن کاملDetermining a Regular Language by Glider-Based Structures called Phases fi -1 in Rule
Rule 110 is a complex elementary cellular automaton able of supporting universal computation and complicated collision-based reactions between gliders. We propose a representation for coding initial conditions by means of a finite subset of regular expressions. The sequences are extracted both from de Bruijn diagrams and tiles specifying a set of phases fi 1 for each glider in Rule 110. The sub...
متن کاملComplex Dynamics Emerging in Rule 30 with Majority Memory
In cellular automata with memory, the unchanged maps of the conventional cellular automata are applied to cells endowed with memory of their past states in some specified interval. We implement Rule 30 automata with a majority memory and show that using the memory function we can transform quasi-chaotic dynamics of classical Rule 30 into domains of travelling structures with predictable behavio...
متن کاملHow to make dull cellular automata complex by adding memory: Rule 126 case study
Using Rule 126 elementary cellular automaton (ECA) we demonstrate that a chaotic discrete system — when enriched with memory – hence exhibits complex dynamics where such space exploits on an ample universe of periodic patterns induced from original information of the ahistorical system. First we analyse classic ECA Rule 126 to identify basic characteristics with mean field theory, basins, and d...
متن کاملUsing de Bruijn Diagrams to Analyze 1d Cellular Automata Traffic Models
We used de Bruijn diagrams to analyze traffic models based on one-dimensional cellular automata. The first model is the rule 184 which simulates traffic flow with the simplest dynamics. The second model is a rule represented by a cellular automaton of order (4,2), which includes all the configurations that can be presented when the model contemplates two speeds. To this cellular automata we den...
متن کامل